Convergence of the Penalty Method Applied to a Constrained Curve Straightening
نویسنده
چکیده
We apply the penalty method to the curve straightening flow of inextensible planar open curves generated by the Kirchhoff bending energy. Thus we consider the curve straightening flow of extensible planar open curves generated by a combination of the Kirchhoff bending energy and a functional penalising deviations from unit arc-length. We start with the governing equations of the explicit parametrisation of the curve and derive an equivalent system for the two quantities indicatrix and arc-length. We prove existence and regularity of solutions and use the indicatrix/arc-length representation to compute the energy dissipation. We prove its coercivity and conclude exponential decay of the energy. Finally, by an application of the Lions-Aubin Lemma, we prove convergence of solutions to a limit curve which is the solution of an analogous gradient flow on the manifold of inextensible open curves. This procedure also allows to characterise the Lagrange multiplier in the limit model as a weak limit of force terms present in the relaxed model.
منابع مشابه
Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملPenalty/barrier Path-following in Linearly Constrained Optimization
In the present paper rather general penalty/barrier path-following methods (e.g. with p-th power penalties, logarithmic barriers, SUMT, exponential penalties) applied to linearly constrained convex optimization problems are studied. In particular, unlike in previous studies [1, 11], here simultaneously different types of penalty/barrier embeddings are included. Together with the assumed 2nd ord...
متن کاملPenalty Methods for a Class of Non-Lipschitz Optimization Problems
We consider a class of constrained optimization problems with a possibly nonconvex non-Lipschitz objective and a convex feasible set being the intersection of a polyhedron and a possibly degenerate ellipsoid. Such problems have a wide range of applications in data science, where the objective is used for inducing sparsity in the solutions while the constraint set models the noise tolerance and ...
متن کامل